GCDHEU: Heuristic Polynomial GCD Algorithm Based on Integer GCD Computation
نویسندگان
چکیده
A heuristic algorithm, GCDHEU, is described for polynomial GCD computation over the integers. The algorithm is based on evaluation at a single large integer value (for each variable), integer GCD computation, and a single-point interpolation scheme. Timing comparisons show that this algorithm is very efficient for most univariate problems and it is also the algorithm of choice for many problems in up to four variables.
منابع مشابه
Evaluation of the Heuristic Polynomial
The Heuristic Polynomial GCD procedure (GCDHEU) is used by the Maple computer algebra system, but no other. Because Maple has an especially eecient kernel that provides fast integer arithmetic, but a relatively slower interpreter for non-kernel code, the GCDHEU routine is especially eeective in that it moves much of the computation into \bignum" arithmetic and hence executes primarily in the ke...
متن کاملA modular integer GCD algorithm
This paper describes the first algorithm to compute the greatest common divisor (GCD) of two n-bit integers using a modular representation for intermediate values U , V and also for the result. It is based on a reduction step, similar to one used in the accelerated algorithm [T. Jebelean, A generalization of the binary GCD algorithm, in: ISSAC ’93: International Symposium on Symbolic and Algebr...
متن کاملSublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers
The atdvent of practical parallel processors has caused a reexamination of many existing algorithms with'the hope of discovering a parallel implementation. One of the oldest and best know algorithms is Euclid's algorithm for computing the greatest common divisor (GCD). In this paper we present a parallel algorithm to compute the GCD of two integers. Although there have been results in the paral...
متن کاملApproximate Polynomial GCD over Integers with Digits-wise Lattice
For the given coprime polynomials over integers, we change their coefficients slightly over integers so that they have a greatest common divisor (GCD) over integers. That is an approximate polynomial GCD over integers. There are only two algorithms known for this problem. One is based on an algorithm for approximate integer GCDs. The other is based on the well-known subresultant mapping and the...
متن کاملComputing Greatest Common Divisors and Factorizations
In a quadratic number field Q(V~D), D a squarefree integer, with class number 1, any algebraic integer can be decomposed uniquely into primes, but for only 21 domains Euclidean algorithms are known. It was shown by Cohn [5] that for D < —19 even remainder sequences with possibly nondecreasing norms cannot determine the GCD of arbitrary inputs. We extend this result by showing that there does no...
متن کامل